منابع مشابه
Radius, diameter, and minimum degree
We give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a connected graph, {ii) a connected trangle-free graph, (iii) a connected C,-free graph with n vertices and with minimum degree 6, where n tends to infinity. Some conjectures for J&-free graphs are also stated. Let G be a connected graph with vertex set V(G) and edge set E(G). For any XJJ E V(G) let dG(x,y) den...
متن کاملStratification and domination in graphs with minimum degree two
A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The Fdomination number of a graphG is the minimum number of red vertices ofG in a red-blue colori...
متن کاملSpectral radius and Hamiltonicity of graphs with large minimum degree
We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. Let G be a graph of order n and λ (G) be the spectral radius of its adjacency matrix. One of the main results of the paper is the following theorem: Let k 2, n k3 + k + 4, and let G be a graph of order n, with minimum degree δ (G) k. If λ (G) n k 1, then G has a Hamiltonian cycle, unless G = K1 _ (Kn k...
متن کاملOn Independent Domination Number of Graphs with given Minimum Degree
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J. Haviland 3] and settles Case = 2 of the corresponding conjecture by O. Favaron 2].
متن کاملBounded-degree minimum-radius spanning trees in wireless sensor networks
a r t i c l e i n f o a b s t r a c t In this paper, we study the problem of computing a spanning tree of a given undirected disk graph such that the radius of the tree is minimized subject to a given degree constraint *. We first introduce an (8, 4)-bicriteria approximation algorithm for unit disk graphs (which is a special case of disk graphs) that computes a spanning tree such that the degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.04.009